146C - Lucky Conversion - CodeForces Solution

greedy *1200

Please click on ads to support us..

Python Code: 

n1 = input()
n2 = input()
c4 = 0
c7 = 0
for i in range(len(n1)):
    if n1[i] != n2[i]:
        if n1[i] < n2[i]:
            c4 += 1
        elif n1[i] > n2[i]:
            c7 += 1
print(max(c4,c7))


Comments

Submit
0 Comments
More Questions

1325D - Ehab the Xorcist
552B - Vanya and Books
1722E - Counting Rectangles
168A - Wizards and Demonstration
168B - Wizards and Minimal Spell
7A - Kalevitch and Chess
912B - New Year's Eve
1537C - Challenging Cliffs
879B - Table Tennis
1674E - Breaking the Wall
1282A - Temporarily unavailable
1366C - Palindromic Paths
336A - Vasily the Bear and Triangle
926A - 2-3-numbers
276D - Little Girl and Maximum XOR
1253C - Sweets Eating
1047A - Little C Loves 3 I
758D - Ability To Convert
733A - Grasshopper And the String
216A - Tiling with Hexagons
1351B - Square
1225A - Forgetting Things
1717A - Madoka and Strange Thoughts
1717B - Madoka and Underground Competitions
61B - Hard Work
959B - Mahmoud and Ehab and the message
802G - Fake News (easy)
1717C - Madoka and Formal Statement
420A - Start Up
1031A - Golden Plate